An Autonomous Metric (Polytope-Convex Hull) For Relative Comparisons of MIQ
نویسنده
چکیده
A means of measuring machine intelligence is presented. The technique is based on geometric procedures and works best on relative comparisons across different entities, rather than absolute comparisons of intelligence.
منابع مشابه
The Set of Correlated Equilibria of 2 × 2 Games ∗
We characterize analytically the correlated equilibrium polytope of all 2× 2 games, both for strategies and payoffs. The correlated equilibrium polytope for games without dominant strategies is either an hexahedron (coordination games) or a single point (competitive games).This characterization allows for simple comparisons of the geometry of these sets with the Nash convex hull, both in terms ...
متن کاملPosterior contraction of the population polytope in finite admixture models
We study the posterior contraction behavior of the latent population structure that arises in admixture models as the amount of data increases. An admixture model — alternatively known as a topic model — specifies k populations, each of which is characterized by a ∆-valued vector of frequencies for generating a set of discrete values in {0, 1, . . . , d}. The population polytope is defined as t...
متن کاملFrequently Asked Questions in Polyhedral Computation
2 Convex Polyhedron 3 2.1 What is convex polytope/polyhedron? . . . . . . . . . . . . . . . . . . . . . . 3 2.2 What are the faces of a convex polytope/polyhedron? . . . . . . . . . . . . . . 3 2.3 What is the face lattice of a convex polytope . . . . . . . . . . . . . . . . . . . 4 2.4 What is a dual of a convex polytope? . . . . . . . . . . . . . . . . . . . . . . . 4 2.5 What is simplex? . ....
متن کاملHigher Dimensional Convex Hull Algorithms 1 Convex hulls
• Sd: A d-Simplex The simplest convex polytope in R. A d-simplex is always the convex hull of some d + 1 affinely independent points. For example, a line segment is a 1− simplex i.e., the smallest convex subspace which contains two points. A triangle is a 2 − simplex and a tetrahedron is a 3− simplex. • P: A Simplicial Polytope. A polytope where each facet is a d− 1 simplex. By our assumption, ...
متن کاملA Property of the Birkhoff Polytope
The Birkhoff polytope Bn is the convex hull of all n× n permutation matrices in Rn×n. We compute the combinatorial symmetry group of the Birkhoff polytope. A representation polytope is the convex hull of some finite matrix group G 6 GL(d,R). We show that the group of permutation matrices is essentially the only finite matrix group which yields a representation polytope with the face lattice of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009